Multiset-based Tree Model for Membrane Computing
نویسندگان
چکیده
In this paper, we introduce a new paradigm multiset-based tree model. We show that trees can be represented in the form of wellfounded multisets. We also show that the conventional approach for this representation is not injective from a set of trees to the class of multisets representing such trees. We establish a oneto-one correspondence between trees and suitable permutations of a wellfounded multiset, which we call tree structures. We give formal definitions of a tree structure and a subtree structure of a tree structure. Finally, we represent membrane structures in the form of tree structures – a form in which membrane structures can suitably be represented at programming level.
منابع مشابه
Translating Multiset Tree Automata into P Systems
In this work we propose a translation scheme to obtain P systems with membrane creation rules from transitions of multiset tree automata (MTA).
متن کاملEditing Distances Between Membrane Structures
In this work we propose an efficient solution to calculate the minimum editing distance between membrane structures of arbitrary P systems. We use a new model of tree automata based on multisets of states and symbols linked to the finite control. This new model accepts a set of trees with symmetries between their internal nodes (mirrored trees). Once we have calculated the editing distance betw...
متن کاملIdentifying P Rules from Membrane Structures with an Error-Correcting Approach
In this work we propose an error-correcting approach to solve the identification of P rules for membrane modifications based on the behavior of the P system. Here, we take the framework of inductive inference from (structural) positive examples. The algorithm that we propose is based on previous definitions of distances between membrane structures and multiset tree automata.
متن کاملRecognizing Membrane Structures with Tree Automata
One of the main components of P systems is the membrane structure that they define. This structure evolves during the computation time due to the application of rules associated to the membranes. The membrane structure can be represented by a tree in which the internal nodes denote regions which have inner regions inside. So, the root of the tree is always associated to the skin membrane of the...
متن کاملOn Two Families of Multiset Tree Automata
The relation between the membrane structures of P systems and an extension of tree automata which introduces multisets in the transition function has been proposed in previous works. Here we propose two features of tree automata which have been previously studied (namely, reversibility and local testability) in order to extend them to multiset tree automata. The characterization of these famili...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- The Computer Science Journal of Moldova
دوره 19 شماره
صفحات -
تاریخ انتشار 2011